On the structure of generalized toric codes
نویسنده
چکیده
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an arbitrary polynomial algebra at the algebraic torus instead of a linear combination of monomials whose exponents are rational points of a convex polytope. We study their multicyclic and metric structure, and we use them to express their dual and to estimate their minimum distance.
منابع مشابه
Lattice polytopes in coding theory
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also include a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations. 2010 MSC: 14M25, 14G50,...
متن کاملToric Codes, Multiplicative Structure and Decoding
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for decoding, resembling the decoding of Reed-Solomon codes and aligns with decoding by error correcting pairs. We have used the multiplicative structure on toric codes to c...
متن کاملThe Order Bound for Toric Codes
In this paper we investigate the minimum distance of generalized toric codes using an order bound like approach. We apply this technique to a family of codes that includes the Joyner code. For some codes in this family we are able to determine the exact minimum distance.
متن کاملRemarks on generalized toric codes
This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S ⊂ R varies with the base field. The main results show that in some cases, over sufficiently large fields, the minimum distance of the code corresponding to a set S will be the same as that of the code corresponding to the convex hull conv(S)....
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 44 شماره
صفحات -
تاریخ انتشار 2009